Tail Inequalities
نویسنده
چکیده
منابع مشابه
Some Probability Inequalities for Quadratic Forms of Negatively Dependent Subgaussian Random Variables
In this paper, we obtain the upper exponential bounds for the tail probabilities of the quadratic forms for negatively dependent subgaussian random variables. In particular the law of iterated logarithm for quadratic forms of independent subgaussian random variables is generalized to the case of negatively dependent subgaussian random variables.
متن کاملTail inequalities for sums of random matrices that depend on the intrinsic dimension
This work provides exponential tail inequalities for sums of random matrices that depend only on intrinsic dimensions rather than explicit matrix dimensions. These tail inequalities are similar to the matrix versions of the Chernoff bound and Bernstein inequality except with the explicit matrix dimensions replaced by a trace quantity that can be small even when the explicit dimensions are large...
متن کاملInequalities between hypergeometric tails
A special inequality between the tail probabilities of certain related hypergeometrics was shown by Seneta and Phipps [19] to suggest useful ‘quasi-exact’ alternatives to Fisher’s [5] Exact Test. With this result as motivation, two inequalities of Hájek and Havránek [6] are investigated in this paper and are generalised to produce inequalities in the form required. A parallel inequality in bino...
متن کاملLaws of Large Numbers and Tail Inequalities for Random Tries and Patricia Trees
We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. If Hn is the height of this tree, we show that Hn/E{Hn} tends to one in probability. Additional tail inequalities are given for the height, depth, size, and profile of these trees and ordinary tries that apply without any conditions on the strin...
متن کاملA Remark on Hypercontractivity and Tail Inequalities for the Largest Eigenvalues of Random Matrices
We point out a simple argument relying on hypercontractivity to describe tail inequalities on the distribution of the largest eigenvalues of random matrices at the rate given by the Tracy–Widom distribution. The result is illustrated on the known examples of the Gaussian and Laguerre unitary ensembles. The argument may be applied to describe the generic tail behavior of eigenfunction measures o...
متن کاملLecture : Tail Inequalities [fa'''] .. Markov's Inequality
The simple recursive structure of skip lists made it relatively easy to derive an upper bound on the expected worst-case search time, by way of a stronger high-probability upper bound on the worst-case search time. We can prove similar results for treaps, but because of the more complex recursive structure, we need slightly more sophisticated probabilistic tools. These tools are usually called ...
متن کامل